/*
 * Copyright (c) 2012 Robert Burrell Donkin robertburrelldonkin.name
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy of this software 
 * and associated documentation files (the "Software"), to deal in the Software without restriction, 
 * including without limitation the rights to use, copy, modify, merge, publish, distribute, 
 * sublicense, and/or sell copies of the Software, and to permit persons to whom the Software 
 * is furnished to do so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice shall be included in all copies or 
 * substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING 
 * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, 
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 * 
 */
package walrus.text.wiki;

import java.nio.CharBuffer;

public class BasicWikiParser {

	private final CharBuffer buffer;
	
	private int numberOfDuplicates;
	private char last;
	
	public BasicWikiParser(final CharBuffer buffer) {
		this.buffer = buffer;
	}

	public void parse() {
		reset();
		buffer.rewind();
		numberOfDuplicates = 0;
		last = 0;
		while (buffer.hasRemaining()) {
			next();
		}
	}
	
	public CharSequence get(final int start, final int end) {
		final int oldPosition = buffer.position();
		buffer.position(0);
		final CharSequence result = buffer.subSequence(start, end);
		buffer.position(oldPosition);
		return result;
	}
	
	public int at() {
		return buffer.position();
	}
	
	protected void reset() {}

	private void next() {
		final char next = buffer.get();
		if (next == last) {
			numberOfDuplicates++;
		} else {
			if (numberOfDuplicates > 0 && last == '=') {
				title(numberOfDuplicates);
			} else if (numberOfDuplicates == 1) {
				switch (last) {
					case '[':
						openSquare();
						break;
					case ']':
						closeSquare();
						break;
					case '{':
						openCurly();
						break;
					case '}':
						closeSquare();
						break;
				}
			} else if (numberOfDuplicates == 2) {
				switch (last) {
				case '\'':
					quote();
					break;
				}
			}
			numberOfDuplicates = 0;
			last = next;
		}
	}

	protected void quote() {}

	protected void openCurly() {}

	protected void closeSquare() {}

	protected void openSquare() {}

	protected void title(final int numberOfDuplicates) {}
}
